The graph connection
نویسندگان
چکیده
منابع مشابه
Rainbow Connection Number of the Thorn Graph
A path in an edge colored graph is said to be a rainbow path if every edge in this path is colored with the same color. The rainbow connection number of G, denoted by rc(G), is the smallest number of colors needed to color its edges, so that every pair of its vertices is connected by at least one rainbow path. A rainbow u − v geodesic in G is a rainbow path of length d(u, v), where d(u, v) is t...
متن کاملRainbow Connection Number of Graph Power and Graph Products
The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. This graph parameter was introduced by Chartrand et al. in 2008. The problem has garnered considerable interest and several variants of the initial version have since been intr...
متن کاملRainbow Connection Number of Graph Power and Graph Products
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (Note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely cartesian p...
متن کاملRanking and Sparsifying a Connection Graph
Many problems arising in dealing with high-dimensional data sets involve connection graphs in which each edge is associated with both an edge weight and a d-dimensional linear transformation. We consider vectorized versions of the PageRank and effective resistance which can be used as basic tools for organizing and analyzing complex data sets. For example, the generalized PageRank and effective...
متن کاملSome Remarks on Completeness , Connection Graph Resolutionand
A new completeness proof that generalizes the Anderson-Bledsoe excess literal argument is developed for connection-graph resolution. This technique also provides a simpliied completeness proof for semantic resolution. Some observations about subsumption and about link deletion are also made. Link deletion is the basis for connection graphs. Subsumption plays an important role in most resolution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Machine Intelligence
سال: 2022
ISSN: ['2522-5839']
DOI: https://doi.org/10.1038/s42256-022-00476-6